Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Privacy preservation algorithm of original data in mobile crowd sensing
JIN Xin, WAN Taochun, LYU Chengmei, WANG Chengtian, CHEN Fulong, ZHAO Chuanxin
Journal of Computer Applications    2020, 40 (11): 3249-3254.   DOI: 10.11772/j.issn.1001-9081.2020020236
Abstract358)      PDF (631KB)(463)       Save
With the popularity of mobile smart devices, Mobile Crowd Sensing (MCS) has been widely used while facing serious privacy leaks. Focusing on the issue that the existing original data privacy protection scheme is unable to resist collusion attacks and reduce the perception data availability, a Data Privacy Protection algorithm based on Mobile Node (DPPMN) was proposed. Firstly, the node manager in DPPMN was used to establish an online node list and send it to the source node. An anonymous path for data transmission was built by the source node through the list. Then, the data was encrypted by using paillier encryption scheme, and the ciphertext was uploaded to the application server along the path. Finally, the required perception data was obtained by the server using ciphertext decryption. The data was encrypted and decrypted during transmission, making sure that the attacker was not able to wiretap the content of the perception data and trace the source of the data along the path. The DPPMN ensures that the application server can access the original data without the privacy invasion of the nodes. Theoretical analysis and experimental results show that DPPMN has higher data security with increasing appropriate communication, and can resist collusion attacks without affecting the availability of data.
Reference | Related Articles | Metrics
Survivability analysis of interdependent network with incomplete information
JIANG Yuxiang, LYU Chen, YU Hongfang
Journal of Computer Applications    2015, 35 (5): 1224-1229.   DOI: 10.11772/j.issn.1001-9081.2015.05.1224
Abstract546)      PDF (1051KB)(523)       Save

This paper proposed a method for analyzing the survivability of interdependent networks with incomplete information. Firstly, the definition of the structure information and the attack information were proposed. A novel model of interdependent network with incomplete attack information was proposed by considering the process of acquiring attack information as the unequal probability sampling by using information breadth parameter and information accuracy parameter in the condition of structure information was known. Secondly, with the help of generating function and the percolation theory, the interdependent network survivability analysis models with random incomplete information and preferential incomplete information were derived. Finally, the scale-free network was taken as an example for further simulations. The research result shows that both information breadth and information accuracy parameters have tremendous impacts on the percolation threshold of interdependent network, and information accuracy parameter has more impact than information breadth parameter. A small number of high accuracy nodes information has the same survivability performance as a large number of low accuracy nodes information. Knowing a small number of the most important nodes can reduce the interdependent network survivability to a large extent. The interdependent network has far lower survivability performance than the single network even in the condition of incomplete attack information.

Reference | Related Articles | Metrics